Parallel query processing in a polystore

نویسندگان

چکیده

The blooming of different data stores has made polystores a major topic in the cloud and big landscape. As amount grows rapidly, it becomes critical to exploit inherent parallel processing capabilities underlying platforms. To fully achieve this, polystore should: (i) preserve expressivity each store’s native query or scripting language (ii) leverage distributed architecture enable integration, i.e. joins, on top retrieval partitioned datasets. In this paper, we address these points by: using polyglot approach CloudMdsQL that allows queries be expressed as inline scripts combined with SQL statements for ad-hoc integration incorporating within LeanXcale engine, thus allowing processed at store shards. addition, (iii) efficient optimization techniques, such bind join, can take place improve performance selective joins. We evaluate benefits exploiting parallelism combination high through our experimental validation.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Polystore Query Rewriting: The Challenges of Variety

Numerous databases marketed as SQL-on-Hadoop, NewSQL [16] and NoSQL have emerged to catalyze Big Data applications. These databases generally support the 3Vs [7]. (i) Volume: amount of data (ii) Velocity: speed of data in and out (iii) Variety: semi-structured and heterogeneous data. As a result of differing use cases and design considerations around the Variety requirement, these new databases...

متن کامل

Parallel Query Processing

With relations growing larger and queries becoming more complex, parallel query processing is an increasingly attractive option for improving the performance of database systems. The objective of this paper is to examine the various issues encountered in parallel query processing and the techniques available for addressing these issues. The focus of the paper is on the join operation with both ...

متن کامل

Parallel Query Processing in DBS3

In this paper, we describe our approach to the compile-time optimization and parallelization of queries for execution in DBS3, a shared-memory parallel database system. Our approach enables exploring a search space large enough to include zigzag trees which are intermediate between left-deep and right-deep trees. Zigzag trees are shown to provide better response time than right-deep trees in th...

متن کامل

Query Processing in a Symmetric Parallel Environment

We consider a database machine consisting of n nodes connected by an O(n*processing speed) bandwidth network. Each node consists of a processor, a random access memory, and a slower but much larger memory such as a disk. In order to approach optimal (O(n)) speedup on this hardware architecture, we partition relations roughly evenly among the processors. We study the problem of optimizing multi-...

متن کامل

Query Processing in a Parallel Object - RelationalDatabase

Object-relational database systems are now being deployed for real use by customers. Researchers and industry users have begun to explore the performance issues that these systems raise. In this paper, we examine some of those performance issues, and evaluate them for object-relational systems in general and for INFORMIX-Universal Server in particular. We describe object-relational query proces...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Distributed and Parallel Databases

سال: 2021

ISSN: ['0926-8782', '1573-7578']

DOI: https://doi.org/10.1007/s10619-021-07322-5